Maximally Node Disjoint Congestion Aware Multipath Routing in Wireless Networks for Delay Minimization

Many multipath routing schemes have recently been proposed to improve the performance of wireless networks. Multipath routing is helpful for reducing end-to-end delay, for distributing the load among paths and also for increasing the throughput. However, multipath routing is not always efficient in terms of delay as, mutual interference between multiple paths may degrade the performance of routing scheme. Therefore, selection of proper paths eventually determines the performance of multipath routing. If the different paths under concern are mutually interference free as well as load balanced, then, multipath routing can lead to better performance. It is shown through simulation that multipath routing with less coupling and congestion improves the efficiency of system in terms of endto-end delay and load balancing than single path routing. In this paper, we have proposed interference and also congestion aware routing paths selection algorithm for parallel distribution of data packets in wireless networks. Simulation results show that congestion and interference aware multipath routing improves the network quality of services (QoS). General Terms Connectivity graph, Algorithm, Dijkstra Shortest Path Algorithm.